Classical versus quantum ontology
نویسندگان
چکیده
منابع مشابه
Essay Review Classical Versus Quantum Ontology
Quantum mechanics faces a strange dilemma. On the one hand it has long been claimed to be an irreducibly statistical theory, allowing the calculation of measurement outcome statistics while being unable to predict the behaviour of individual microphysical processes. On the other hand, quantum mechanics has been increasingly used, with stunning success in the past few decades, to gain experiment...
متن کاملRandomness: quantum versus classical
Recent tremendous development of quantum information theory led to a number of quantum technological projects, e.g., quantum random generators. This development stimulates a new wave of interest in quantum foundations. One of the most intriguing problems of quantum foundations is elaboration of a consistent and commonly accepted interpretation of quantum state. Closely related problem is clarif...
متن کاملQuantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact learning from membership queries and Valiant’s Probably Approximately Correct (PAC) model of learning from random examples. For each of these two learning models we establish a polynomial relationship between the number of...
متن کاملQuantum versus classical correlations in Gaussian states.
Quantum discord, a measure of genuinely quantum correlations, is generalized to continuous variable systems. For all two-mode Gaussian states, we calculate analytically the quantum discord and a related measure of classical correlations, solving an optimization over all Gaussian measurements. Almost all two-mode Gaussian states are shown to have quantum correlations, while for separable states,...
متن کاملTwo Classical Queries versus One Quantum Query
In this note we study the power of so called query-limited computers. We compare the strength of a classical computer that is allowed to ask two NP-questions to an oracle with the strength of a quantum computer that is allowed only one such query. It is shown that any decision problem that requires two parallel (non-adaptive) sat-queries on a classical computer can be solved exactly by a quantu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics
سال: 2002
ISSN: 1355-2198
DOI: 10.1016/s1355-2198(02)00023-0